Generalized problem of linear copositive programming
نویسندگان
چکیده
منابع مشابه
Integer Linear Programming Formulation of the Generalized Vehicle Routing Problem
The Generalized Vehicle Routing Problem (GVRP) is an extension of the Vehicle Routing Problem (VRP) defined on a graph in which the nodes (customers, vertices) are grouped into a given number of mutually exclusive and exhaustive clusters (nodesets). In this paper, an integer linear programming formulation of the GVRP with O(n 2 ) binary variables and O(n 2 ) constraints is presented. It is show...
متن کاملCopositive Programming – a Survey
Copositive programming is a relatively young field in mathematical optimization. It can be seen as a generalization of semidefinite programming, since it means optimizing over the cone of so called copositive matrices. Like semidefinite programming, it has proved particularly useful in combinatorial and quadratic optimization. The purpose of this survey is to introduce the field to interested r...
متن کاملChapter 8 Copositive Programming
A symmetric matrix S is copositive if yT S y≥0 for all y≥0, and the set of all copositive matrices, denoted C∗, is a closed, pointed, convex cone; see [25] for a recent survey. Researchers have realized how to model many NP-hard optimization problems as copositive programs, that is, programs over C∗ for which the objective and all other constraints are linear [7, 9, 13, 16, 32–34]. This makes c...
متن کاملApproximation of Copositive Programming via Linear Programming Using Second Order Sum of Square Decomposition
In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copos-itive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more accurately by a linear programming.
متن کاملCopositive Programming by Simplicial Partition
Copositivity plays an important role in combinatorial and quadratic optimization since setting up a linear optimization problem over the copositive cone leads to exact reformulations of combinatorial and quadratic programming problems. A copositive programming problem may be approached checking copositivity of several matrices built with different values of the variable and the solution is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series
سال: 2019
ISSN: 2524-2415,1561-2430
DOI: 10.29235/1561-2430-2019-55-3-299-308